package LCR;

import java.util.Arrays;

public class checkInclusion {
    public boolean checkInclusion(String s1, String s2) {
        int n = s1.length();
        int m = s2.length();
        int[] cnt1 = new int[26];
        int[] cnt2 = new int[26];
        if(n > m) {
            return false;
        }
        for(int i =0;i < n;i++) {
            cnt1[s1.charAt(i)-'a']++;
            cnt2[s2.charAt(i)-'a']++;
        }
        if(Arrays.equals(cnt1,cnt2)) {
            return true;
        }
        for(int i = n;i < m;i++) {
            cnt2[s2.charAt(i)-'a']++;
            cnt2[s2.charAt(i-n)-'a']--;
            if(Arrays.equals(cnt1,cnt2)) {
                return true;
            }
        }
        return false;

    }
}
